Relaxing state-access constraints in stateful programmable data planes
نویسندگان
چکیده
منابع مشابه
Relaxing state-access constraints in stateful programmable data planes
Supporting the programming of stateful packet forwarding functions in hardware has recently attracted the interest of the research community. When designing such switching chips, the challenge is to guarantee the ability to program functions that can read and modify data plane’s state, while keeping line rate performance and state consistency. Current state-of-the-art designs are based on a ver...
متن کاملRelaxing constraints in stateful network data plane design
Modern network devices have to meet stringent performance requirements while providing support for a growing number of use cases and applications. In such a context, a programmable network data plane has emerged as an important feature of modern forwarding elements, such as switches and network cards. Bosshart et al. [1] introduced RMT, a first example of a high-performance programmable data pl...
متن کاملBUZZ: Testing Context-Dependent Policies in Stateful Data Planes
Network operators spend significant effort in ensuring that the network meets their intended policies. While recent work on checking reachability and isolation policies have taken giant strides in this regard, they do not handle context-dependent policies that operators implement via stateful data plane elements. To address this challenge, we present the design and implementation of BUZZ, a tes...
متن کاملDemo: Implementing iptables using a programmable stateful data plane abstraction
Iptables is a well known Linux’s user interface to control the Netfiltermodule, which is responsible for processing packets traversing the Linux’s networking subsystem. In cooperation with the conntrackmodule, Netfilter supports a wide range of network functions such as: filtering, NAT, stateful firewall, load balancer, anomaly detection, etc. Given the central role of the iptables’ functions i...
متن کاملRelaxing Causal Constraints in PDES
One of the major overheads that prohibits the wide spread deployment of parallel discrete event simulation (PDES) is the need to synchronize the distributed processes in the simulation. Considerable investigations have been conducted to analyze and optimize the two widely used synchronization strategies, namely the conservative and the optimistic simulation paradigms. However, little attention ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 2018
ISSN: 0146-4833
DOI: 10.1145/3211852.3211854